Affine connexions in an almost product space

Almost Affine Lambda Terms

It is proved that a λ-term that has a negatively non-duplicated typing is always βη-equal to an almost affine λ-term.

Almost Affine Codes

Flags of almost affine codes

We describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues of relative generalized Hamming weights in the linear case.

More On Embedding an Affine Space in a Vector Space

for all a1 . . . , am ∈ E, all v1, . . . , vm ∈ −→E , and all λ1, . . . , λm ∈ R. Furthermore, for λi = 0, 1 ≤ i ≤ m, we have f̂(v1 +̂ λ1a1, . . . , vm +̂ λmam) = λ1 · · ·λmf(a1 + λ−1 1 v1, . . . , am + λ−1 m vm). Proof . Let us assume that f̂ exists. We first prove by induction on k, 1 ≤ k ≤ m, that f̂(a1, . . . , vi1 , . . . , vik , . . . , am) = fS(vi1 , . . . , vik), for every S ⊆ {1, . . . ,m},...

An Ideal Separating Extension of Affine Space

In affine space the set of solutions to a system of polynomial equations does not uniquely determine the system. We extend affine space so that the solutions (in the extension) to a system of equations uniquely determines the system. 1. Statement of the problem In particular, for field R let elements of R[x] = R[x1, ..., xn] act on the set of power series R[[T ]] = R[[T1, ..., Tn]] by way of th...